________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 11:03:12
Input Data from:  dataset147.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :20
Ex.Facilities   :3
Total budget    :25000
Terror. attacks :3

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,0645
Average f[i]   :4550
Average g[i,j] :1976,47058823529
Total demand   :5680
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 18
> Selected Move:	570	1	-1	17	4000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0    >new incumb.: 570


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 81
> Selected Move:	920	1	-1	6	9000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0    >new incumb.: 920


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 97
> Selected Move:	1270	1	-1	7	14500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0    >new incumb.: 1270


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 108
> Selected Move:	1600	1	-1	11	20500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  1  0  0  0  0  0  1  0  0    >new incumb.: 1600


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 119
> Selected Move:	1830	1	-1	16	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  1  0  0  0  0  1  1  0  0    >new incumb.: 1830


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 72
> Selected Move:	1820	3	11	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 72
> Selected Move:	1770	3	12	9	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  1  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 73
> Selected Move:	1720	3	16	14	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  1  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 94
> Selected Move:	1780	3	9	11	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 88
> Selected Move:	1770	3	11	12	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 86
> Selected Move:	1740	3	7	11	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 69
> Selected Move:	1690	3	12	9	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 68
> Selected Move:	1660	3	11	12	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 69
> Selected Move:	1590	3	12	4	24500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  1  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 94
> Selected Move:	1640	3	14	16	25000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  1  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 75
> Selected Move:	1640	3	9	11	25000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 73
> Selected Move:	1630	3	11	12	25000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 71
> Selected Move:	1580	3	16	8	25000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 89
> Selected Move:	1700	3	4	7	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 94
> Selected Move:	1710	3	12	11	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  0  0  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 94
> Selected Move:	1610	3	11	19	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  0  0  0  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 109
> Selected Move:	1670	3	8	16	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  0  0  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 84
> Selected Move:	1640	3	19	3	24000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  0  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 107
> Selected Move:	1680	3	6	11	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 82
> Selected Move:	1630	3	16	14	24500


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 101
> Selected Move:	1608	3	3	12	25500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 65
> Selected Move:	1570	4	1	7	22000


> New Y[]: 
	
	 2  0  4  0  0  0  0  3  0  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 92
> Selected Move:	1600	3	12	6	21000


> New Y[]: 
	
	 2  0  4  0  0  0  1  3  0  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 94
> Selected Move:	1625	1	-1	16	25500


> New Y[]: 
	
	 2  0  4  0  0  0  1  3  0  0  0  1  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 53
> Selected Move:	1666	4	7	11	25400


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  3  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 54
> Selected Move:	1810	3	11	12	24900


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  0  3  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 63
> Selected Move:	1760	3	12	9	25000


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  3  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 59
> Selected Move:	1630	3	7	4	25000


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  3  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 59
> Selected Move:	1620	3	9	12	24900


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  0  3  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 66
> Selected Move:	1636	3	4	11	25400


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  3  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 58
> Selected Move:	1570	2	14	-1	21400


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  3  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 91
> Selected Move:	1600	3	12	7	21500


> New Y[]: 
	
	 2  0  4  0  0  0  1  3  0  0  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 94
> Selected Move:	1600	4	7	6	22500


> New Y[]: 
	
	 2  0  4  0  0  0  3  1  0  0  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 93
> Selected Move:	1600	4	6	11	21400


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  3  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 95
> Selected Move:	1600	4	11	16	22500


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  1  0  0  0  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 90
> Selected Move:	1600	4	16	17	22900


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  1  0  0  0  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 95
> Selected Move:	1600	3	16	14	22400


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  1  0  0  1  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 92
> Selected Move:	1600	4	17	6	22000


> New Y[]: 
	
	 2  0  4  0  0  0  3  1  0  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 93
> Selected Move:	1600	4	6	11	20900


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  3  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 98
> Selected Move:	1600	4	11	14	22900


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  1  0  0  3  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 91
> Selected Move:	1590	3	11	12	22900


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  0  1  0  3  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 92
> Selected Move:	1590	4	14	6	22000


> New Y[]: 
	
	 2  0  4  0  0  0  3  1  0  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 94
> Selected Move:	1590	4	6	7	21000


> New Y[]: 
	
	 2  0  4  0  0  0  1  3  0  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 96
> Selected Move:	1665	1	-1	16	25500


> New Y[]: 
	
	 2  0  4  0  0  0  1  3  0  0  0  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 75
> Selected Move:	1630	3	12	3	24500


> New Y[]: 
	
	 2  0  4  1  0  0  1  3  0  0  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 88
> Selected Move:	1630	4	7	3	24600


> New Y[]: 
	
	 2  0  4  3  0  0  1  1  0  0  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 88
> Selected Move:	1605	3	3	19	25200


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  0  0  0  1  0  1  1  0  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 90
> Selected Move:	1580	3	19	13	24900


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  0  0  3  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 98
> Selected Move:	1571	3	13	5	25300


> New Y[]: 
	
	 2  0  4  0  0  3  1  1  0  0  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 88
> Selected Move:	1550	3	5	15	24600


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  0  0  0  1  3  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 103
> Selected Move:	1550	4	15	7	25000


> New Y[]: 
	
	 2  0  4  0  0  0  1  3  0  0  0  0  0  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 104
> Selected Move:	1635	3	15	9	25500


> New Y[]: 
	
	 2  0  4  0  0  0  1  3  0  1  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 77
> Selected Move:	1602	3	7	12	25400


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  1  0  0  3  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,25

## ITERATION 58 #######################


> Neighbours evaluated; 43
> Selected Move:	1575	4	12	9	25500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  3  0  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,255

## ITERATION 59 #######################


> Neighbours evaluated; 48
> Selected Move:	1603	3	12	11	25500


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  3  0  1  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,26

## ITERATION 60 #######################


> Neighbours evaluated; 48
> Selected Move:	1600	3	11	3	24500


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  3  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,265

## ITERATION 61 #######################


> Neighbours evaluated; 67
> Selected Move:	1610	3	6	7	25000


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  0  3  0  0  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,27

## ITERATION 62 #######################


> Neighbours evaluated; 63
> Selected Move:	1585	3	16	6	25500


> New Y[]: 
	
	 2  0  4  1  0  0  1  1  0  3  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,275

## ITERATION 63 #######################


> Neighbours evaluated; 63
> Selected Move:	1590	3	9	1	23500


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  0  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,28

## ITERATION 64 #######################


> Neighbours evaluated; 115
> Selected Move:	1660	3	14	11	25500


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  0  0  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 65 #######################


> Neighbours evaluated; 99
> Selected Move:	1610	3	7	16	24500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  0  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,29

## ITERATION 66 #######################


> Neighbours evaluated; 106
> Selected Move:	1645	3	3	12	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,295

## ITERATION 67 #######################


> Neighbours evaluated; 76
> Selected Move:	1593	3	12	9	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,3

## ITERATION 68 #######################


> Neighbours evaluated; 74
> Selected Move:	1610	3	11	3	24500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,305

## ITERATION 69 #######################


> Neighbours evaluated; 108
> Selected Move:	1620	3	6	7	25000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  1  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,3

## ITERATION 70 #######################


> Neighbours evaluated; 97
> Selected Move:	1570	3	16	6	25500


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  1  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,305

## ITERATION 71 #######################


> Neighbours evaluated; 95
> Selected Move:	1610	3	9	4	25000


> New Y[]: 
	
	 2  3  4  1  1  0  1  1  0  0  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 72 #######################


> Neighbours evaluated; 110
> Selected Move:	1580	3	4	8	24000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  1  0  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 73 #######################


> Neighbours evaluated; 112
> Selected Move:	1570	3	8	15	25000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  0  0  0  0  0  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 74 #######################


> Neighbours evaluated; 111
> Selected Move:	1560	3	3	16	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  0  0  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,295

## ITERATION 75 #######################


> Neighbours evaluated; 111
> Selected Move:	1590	3	15	13	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 76 #######################


> Neighbours evaluated; 108
> Selected Move:	1590	3	13	18	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  0  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 77 #######################


> Neighbours evaluated; 107
> Selected Move:	1550	3	18	8	23500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  0  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,28

## ITERATION 78 #######################


> Neighbours evaluated; 109
> Selected Move:	1590	3	6	11	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  0  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,275

## ITERATION 79 #######################


> Neighbours evaluated; 111
> Selected Move:	1585	3	8	12	26000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  0  0  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,27

## ITERATION 80 #######################


> Neighbours evaluated; 75
> Selected Move:	1580	3	11	8	24500


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,265

## ITERATION 81 #######################


> Neighbours evaluated; 110
> Selected Move:	1550	3	7	11	25000


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  1  0  0  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,26

## ITERATION 82 #######################


> Neighbours evaluated; 95
> Selected Move:	1550	3	16	6	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  0  0  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 83 #######################


> Neighbours evaluated; 101
> Selected Move:	1590	3	12	4	25000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  0  0  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 84 #######################


> Neighbours evaluated; 113
> Selected Move:	1590	3	8	14	24500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,245

## ITERATION 85 #######################


> Neighbours evaluated; 111
> Selected Move:	1590	3	4	19	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  0  0  1  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,24

## ITERATION 86 #######################


> Neighbours evaluated; 106
> Selected Move:	1620	3	11	7	24500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  0  0  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,235

## ITERATION 87 #######################


> Neighbours evaluated; 114
> Selected Move:	1610	3	19	5	25000


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  0  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,23

## ITERATION 88 #######################


> Neighbours evaluated; 111
> Selected Move:	1545	3	14	16	25500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  0  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,225

## ITERATION 89 #######################


> Neighbours evaluated; 105
> Selected Move:	1510	3	5	4	24500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  0  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,22

## ITERATION 90 #######################


> Neighbours evaluated; 108
> Selected Move:	1520	3	16	8	24500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  1  0  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 91 #######################


> Neighbours evaluated; 113
> Selected Move:	1550	3	4	9	25000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  1  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,21

## ITERATION 92 #######################


> Neighbours evaluated; 114
> Selected Move:	1525	3	8	11	26500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  1  0  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,205

## ITERATION 93 #######################


> Neighbours evaluated; 77
> Selected Move:	1613	3	9	12	26500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 94 #######################


> Neighbours evaluated; 88
> Selected Move:	1590	2	11	-1	20500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  0  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 95 #######################


> Neighbours evaluated; 114
> Selected Move:	1590	3	1	16	22500


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  0  1  0  0  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,19

## ITERATION 96 #######################


> Neighbours evaluated; 99
> Selected Move:	1590	4	16	6	22500


> New Y[]: 
	
	 2  0  4  0  0  0  3  1  0  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,185

## ITERATION 97 #######################


> Neighbours evaluated; 99
> Selected Move:	1590	4	6	7	21500


> New Y[]: 
	
	 2  0  4  0  0  0  1  3  0  0  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,18

## ITERATION 98 #######################


> Neighbours evaluated; 100
> Selected Move:	1590	4	7	12	20900


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  0  3  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,175

## ITERATION 99 #######################


> Neighbours evaluated; 96
> Selected Move:	1630	1	-1	8	25400


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  1  0  0  0  3  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,17

## ITERATION 100 #######################


> Neighbours evaluated; 84
> Selected Move:	1700	3	16	14	24900


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  1  0  0  0  3  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,165

## ITERATION 101 #######################


> Neighbours evaluated; 86
> Selected Move:	1689	3	8	11	26400


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  1  3  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,16

## ITERATION 102 #######################


> Neighbours evaluated; 74
> Selected Move:	1706	3	6	16	25900


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  0  0  1  3  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,155

## ITERATION 103 #######################


> Neighbours evaluated; 87
> Selected Move:	1633	4	12	11	26400


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  0  0  3  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,15

## ITERATION 104 #######################


> Neighbours evaluated; 82
> Selected Move:	1645	3	7	6	25900


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  3  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,155

## ITERATION 105 #######################


> Neighbours evaluated; 87
> Selected Move:	1626	3	16	7	26900


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  3  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,16

## ITERATION 106 #######################


> Neighbours evaluated; 72
> Selected Move:	1656	3	12	3	25900


> New Y[]: 
	
	 2  0  4  1  0  0  1  1  0  0  0  3  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,165

## ITERATION 107 #######################


> Neighbours evaluated; 77
> Selected Move:	1644	3	3	8	25400


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  1  0  0  3  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,17

## ITERATION 108 #######################


> Neighbours evaluated; 81
> Selected Move:	1625	4	11	7	25500


> New Y[]: 
	
	 2  0  4  0  0  0  1  3  1  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,175

## ITERATION 109 #######################


> Neighbours evaluated; 84
> Selected Move:	1625	3	8	3	26000


> New Y[]: 
	
	 2  0  4  1  0  0  1  3  0  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,18

## ITERATION 110 #######################


> Neighbours evaluated; 75
> Selected Move:	1602	4	7	3	26100


> New Y[]: 
	
	 2  0  4  3  0  0  1  1  0  0  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,185

## ITERATION 111 #######################


> Neighbours evaluated; 78
> Selected Move:	1582	3	7	16	25100


> New Y[]: 
	
	 2  0  4  3  0  0  1  0  0  0  0  1  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,19

## ITERATION 112 #######################


> Neighbours evaluated; 79
> Selected Move:	1600	4	3	11	24900


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  0  0  0  3  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,195

## ITERATION 113 #######################


> Neighbours evaluated; 87
> Selected Move:	1592	3	6	7	25400


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  0  0  0  3  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,2

## ITERATION 114 #######################


> Neighbours evaluated; 80
> Selected Move:	1580	3	3	8	24900


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  1  0  0  3  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,205

## ITERATION 115 #######################


> Neighbours evaluated; 82
> Selected Move:	1580	4	11	7	25000


> New Y[]: 
	
	 2  0  4  0  0  0  0  3  1  0  0  1  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,21

## ITERATION 116 #######################


> Neighbours evaluated; 85
> Selected Move:	1570	3	11	12	25000


> New Y[]: 
	
	 2  0  4  0  0  0  0  3  1  0  0  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,215

## ITERATION 117 #######################


> Neighbours evaluated; 77
> Selected Move:	1593	3	16	6	25500


> New Y[]: 
	
	 2  0  4  0  0  0  1  3  1  0  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,22

## ITERATION 118 #######################


> Neighbours evaluated; 82
> Selected Move:	1580	3	12	3	24500


> New Y[]: 
	
	 2  0  4  1  0  0  1  3  1  0  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,225

## ITERATION 119 #######################


> Neighbours evaluated; 81
> Selected Move:	1580	4	7	3	24600


> New Y[]: 
	
	 2  0  4  3  0  0  1  1  1  0  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,22

## ITERATION 120 #######################


> Neighbours evaluated; 80
> Selected Move:	1580	4	3	8	25000


> New Y[]: 
	
	 2  0  4  1  0  0  1  1  3  0  0  0  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 121 #######################


> Neighbours evaluated; 81
> Selected Move:	1549	3	8	15	25100


> New Y[]: 
	
	 2  0  4  1  0  0  1  1  0  0  0  0  0  0  1  3  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 122 #######################


> Neighbours evaluated; 92
> Selected Move:	1526	3	15	12	25400


> New Y[]: 
	
	 2  0  4  1  0  0  1  1  0  0  0  0  3  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 123 #######################


> Neighbours evaluated; 79
> Selected Move:	1590	2	3	-1	20400


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  0  3  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,2

## ITERATION 124 #######################


> Neighbours evaluated; 96
> Selected Move:	1590	4	12	17	22400


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  0  1  0  1  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,195

## ITERATION 125 #######################


> Neighbours evaluated; 102
> Selected Move:	1590	3	14	16	22900


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  0  1  0  0  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,19

## ITERATION 126 #######################


> Neighbours evaluated; 96
> Selected Move:	1570	3	6	11	23900


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  0  0  1  1  0  0  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,185

## ITERATION 127 #######################


> Neighbours evaluated; 77
> Selected Move:	1570	4	17	7	22500


> New Y[]: 
	
	 2  0  4  0  0  0  0  3  0  0  0  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,18

## ITERATION 128 #######################


> Neighbours evaluated; 93
> Selected Move:	1580	1	-1	14	26500


> New Y[]: 
	
	 2  0  4  0  0  0  0  3  0  0  0  1  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,175

## ITERATION 129 #######################


> Neighbours evaluated; 69
> Selected Move:	1583	3	12	3	25500


> New Y[]: 
	
	 2  0  4  1  0  0  0  3  0  0  0  1  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,17

## ITERATION 130 #######################


> Neighbours evaluated; 85
> Selected Move:	1568	4	7	3	25600


> New Y[]: 
	
	 2  0  4  3  0  0  0  1  0  0  0  1  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,175

## ITERATION 131 #######################


> Neighbours evaluated; 86
> Selected Move:	1558	3	3	6	26500


> New Y[]: 
	
	 2  0  4  0  0  0  3  1  0  0  0  1  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,18

## ITERATION 132 #######################


> Neighbours evaluated; 85
> Selected Move:	1550	4	6	16	26500


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  1  0  0  1  0  3  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,185

## ITERATION 133 #######################


> Neighbours evaluated; 83
> Selected Move:	1563	3	16	9	26500


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  3  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,19

## ITERATION 134 #######################


> Neighbours evaluated; 50
> Selected Move:	1550	4	0	6	23900


> New Y[]: 
	
	 0  0  4  0  0  0  2  1  0  3  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,195

## ITERATION 135 #######################


> Neighbours evaluated; 59
> Selected Move:	1570	3	6	12	23900


> New Y[]: 
	
	 0  0  4  0  0  0  0  1  0  3  0  1  2  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,2

## ITERATION 136 #######################


> Neighbours evaluated; 49
> Selected Move:	1570	4	9	7	24400


> New Y[]: 
	
	 0  0  4  0  0  0  0  3  0  1  0  1  2  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 137 #######################


> Neighbours evaluated; 44
> Selected Move:	1570	4	7	11	24300


> New Y[]: 
	
	 0  0  4  0  0  0  0  1  0  1  0  3  2  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 138 #######################


> Neighbours evaluated; 43
> Selected Move:	1570	4	11	12	22900


> New Y[]: 
	
	 0  0  4  0  0  0  0  1  0  1  0  2  3  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 139 #######################


> Neighbours evaluated; 60
> Selected Move:	1570	4	11	7	23500


> New Y[]: 
	
	 0  0  4  0  0  0  0  2  0  1  0  1  3  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 140 #######################


> Neighbours evaluated; 55
> Selected Move:	1570	4	7	9	23600


> New Y[]: 
	
	 0  0  4  0  0  0  0  1  0  2  0  1  3  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 141 #######################


> Neighbours evaluated; 54
> Selected Move:	1570	4	12	7	24200


> New Y[]: 
	
	 0  0  4  0  0  0  0  3  0  2  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,2

## ITERATION 142 #######################


> Neighbours evaluated; 45
> Selected Move:	1570	4	7	9	23600


> New Y[]: 
	
	 0  0  4  0  0  0  0  2  0  3  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,195

## ITERATION 143 #######################


> Neighbours evaluated; 53
> Selected Move:	1570	4	7	11	23000


> New Y[]: 
	
	 0  0  4  0  0  0  0  1  0  3  0  2  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,19

## ITERATION 144 #######################


> Neighbours evaluated; 58
> Selected Move:	1570	4	9	7	23500


> New Y[]: 
	
	 0  0  4  0  0  0  0  3  0  1  0  2  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,185

## ITERATION 145 #######################


> Neighbours evaluated; 54
> Selected Move:	1570	4	7	11	24000


> New Y[]: 
	
	 0  0  4  0  0  0  0  2  0  1  0  3  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,18

## ITERATION 146 #######################


> Neighbours evaluated; 45
> Selected Move:	1570	4	7	9	24100


> New Y[]: 
	
	 0  0  4  0  0  0  0  1  0  2  0  3  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,175

## ITERATION 147 #######################


> Neighbours evaluated; 51
> Selected Move:	1570	3	9	0	21900


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  0  0  3  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,17

## ITERATION 148 #######################


> Neighbours evaluated; 96
> Selected Move:	1570	4	11	12	21400


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  0  0  1  3  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,165

## ITERATION 149 #######################


> Neighbours evaluated; 96
> Selected Move:	1570	4	12	14	23900


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  0  0  1  1  0  3  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,16

## ITERATION 150 #######################


> Neighbours evaluated; 78
> Selected Move:	1570	4	14	17	23400


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  0  0  1  1  0  1  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,155

## ITERATION 151 #######################


> Neighbours evaluated; 95
> Selected Move:	1570	3	7	6	22900


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  1  0  1  0  0  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,15

## ITERATION 152 #######################


> Neighbours evaluated; 92
> Selected Move:	1570	4	17	6	22500


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  0  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,145

## ITERATION 153 #######################


> Neighbours evaluated; 95
> Selected Move:	1570	4	6	11	21400


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  3  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,14

## ITERATION 154 #######################


> Neighbours evaluated; 94
> Selected Move:	1570	4	11	12	20900


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  3  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,135

## ITERATION 155 #######################


> Neighbours evaluated; 89
> Selected Move:	1626	1	-1	8	25400


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  1  0  0  1  3  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,13

## ITERATION 156 #######################


> Neighbours evaluated; 78
> Selected Move:	1618	3	8	4	26400


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  0  0  0  1  3  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0 
 > pw :0,125

## ITERATION 157 #######################


> Neighbours evaluated; 75
> Selected Move:	1618	3	11	7	25900


> New Y[]: 
	
	 2  0  4  0  1  0  1  1  0  0  0  0  3  0  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,12

## ITERATION 158 #######################


> Neighbours evaluated; 81
> Selected Move:	1642	3	4	9	26400


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  1  0  0  3  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,115

## ITERATION 159 #######################


> Neighbours evaluated; 79
> Selected Move:	1638	4	12	9	26500


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  3  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0 
 > pw :0,12

## ITERATION 160 #######################


> Neighbours evaluated; 82
> Selected Move:	1630	3	9	16	26500


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  0  1  0  1  0  3  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,125

## ITERATION 161 #######################


> Neighbours evaluated; 90
> Selected Move:	1623	4	16	6	26500


> New Y[]: 
	
	 2  0  4  0  0  0  3  1  0  0  0  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,13

## ITERATION 162 #######################


> Neighbours evaluated; 94
> Selected Move:	1570	3	6	9	26000


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  3  0  0  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,135

## ITERATION 163 #######################


> Neighbours evaluated; 68
> Selected Move:	1595	3	12	11	26000


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  3  0  1  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,14

## ITERATION 164 #######################


> Neighbours evaluated; 80
> Selected Move:	1560	3	14	6	27000


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  3  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,145

## ITERATION 165 #######################


> Neighbours evaluated; 62
> Selected Move:	1645	3	9	12	26900


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  0  0  0  1  3  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,15

## ITERATION 166 #######################


> Neighbours evaluated; 79
> Selected Move:	1570	2	6	-1	21900


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  0  0  1  3  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,155

## ITERATION 167 #######################


> Neighbours evaluated; 95
> Selected Move:	1570	4	12	11	22400


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  0  0  3  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,16

## ITERATION 168 #######################


> Neighbours evaluated; 93
> Selected Move:	1570	4	11	16	23500


> New Y[]: 
	
	 2  0  4  0  0  0  0  1  0  0  0  1  1  0  0  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,165

## ITERATION 169 #######################


> Neighbours evaluated; 93
> Selected Move:	1570	3	7	6	23000


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  1  0  0  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,17

## ITERATION 170 #######################


> Neighbours evaluated; 86
> Selected Move:	1570	4	16	6	23000


> New Y[]: 
	
	 2  0  4  0  0  0  3  0  0  0  0  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,175

## ITERATION 171 #######################


> Neighbours evaluated; 85
> Selected Move:	1570	4	6	11	21900


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  3  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,17

## ITERATION 172 #######################


> Neighbours evaluated; 91
> Selected Move:	1570	4	11	17	23400


> New Y[]: 
	
	 2  0  4  0  0  0  1  0  0  0  0  1  1  0  0  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0 
 > pw :0,165

## ITERATION 173 #######################


> Neighbours evaluated; 86
> Selected Move:	1540	3	0	7	25000


> New Y[]: 
	
	 0  0  4  0  0  0  1  2  0  0  0  1  1  0  0  0  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,16

## ITERATION 174 #######################


> Neighbours evaluated; 44
> Selected Move:	1550	3	12	9	25000


> New Y[]: 
	
	 0  0  4  0  0  0  1  2  0  1  0  1  0  0  0  0  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,155

## ITERATION 175 #######################


> Neighbours evaluated; 53
> Selected Move:	1550	4	7	11	24400


> New Y[]: 
	
	 0  0  4  0  0  0  1  1  0  1  0  2  0  0  0  0  1  3  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,15

## ITERATION 176 #######################


> Neighbours evaluated; 65
> Selected Move:	1550	4	17	6	24000


> New Y[]: 
	
	 0  0  4  0  0  0  3  1  0  1  0  2  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0 
 > pw :0,145

## ITERATION 177 #######################


> Neighbours evaluated; 59
> Selected Move:	1570	3	6	12	23400


> New Y[]: 
	
	 0  0  4  0  0  0  0  1  0  1  0  2  3  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,14

## ITERATION 178 #######################


> Neighbours evaluated; 61
> Selected Move:	1570	4	11	7	24000


> New Y[]: 
	
	 0  0  4  0  0  0  0  2  0  1  0  1  3  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,135

## ITERATION 179 #######################


> Neighbours evaluated; 58
> Selected Move:	1570	4	7	9	24100


> New Y[]: 
	
	 0  0  4  0  0  0  0  1  0  2  0  1  3  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,13

## ITERATION 180 #######################


> Neighbours evaluated; 56
> Selected Move:	1570	4	9	12	24400


> New Y[]: 
	
	 0  0  4  0  0  0  0  1  0  3  0  1  2  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,125

## ITERATION 181 #######################


> Neighbours evaluated; 52
> Selected Move:	1570	4	9	7	24900


> New Y[]: 
	
	 0  0  4  0  0  0  0  3  0  1  0  1  2  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,12

## ITERATION 182 #######################


> Neighbours evaluated; 46
> Selected Move:	1570	4	7	11	24800


> New Y[]: 
	
	 0  0  4  0  0  0  0  1  0  1  0  3  2  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,115

## ITERATION 183 #######################


> Neighbours evaluated; 49
> Selected Move:	1570	4	12	7	24500


> New Y[]: 
	
	 0  0  4  0  0  0  0  2  0  1  0  3  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,11

## ITERATION 184 #######################


> Neighbours evaluated; 54
> Selected Move:	1570	4	7	9	24600


> New Y[]: 
	
	 0  0  4  0  0  0  0  1  0  2  0  3  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,105

## ITERATION 185 #######################


> Neighbours evaluated; 52
> Selected Move:	1570	4	9	11	23500


> New Y[]: 
	
	 0  0  4  0  0  0  0  1  0  3  0  2  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,0999999999999996

## ITERATION 186 #######################


> Neighbours evaluated; 62
> Selected Move:	1570	4	9	7	24000


> New Y[]: 
	
	 0  0  4  0  0  0  0  3  0  1  0  2  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,0949999999999996

## ITERATION 187 #######################


> Neighbours evaluated; 59
> Selected Move:	1570	4	7	16	25000


> New Y[]: 
	
	 0  0  4  0  0  0  0  1  0  1  0  2  1  0  0  0  3  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  0  0  0 
 > pw :0,0899999999999996

## ITERATION 188 #######################


> Neighbours evaluated; 56
> Selected Move:	1570	3	16	1	23000


> New Y[]: 
	
	 0  3  4  0  0  0  0  1  0  1  0  2  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 189 #######################


> Neighbours evaluated; 103
> Selected Move:	1665	1	-1	6	28000


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  1  0  2  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,0799999999999996

## ITERATION 190 #######################


> Neighbours evaluated; 109
> Selected Move:	1690	3	11	0	26500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  1  0  0  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,0749999999999996

## ITERATION 191 #######################


> Neighbours evaluated; 117
> Selected Move:	1673	3	7	16	25500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  0  1  0  0  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,0699999999999996

## ITERATION 192 #######################


> Neighbours evaluated; 116
> Selected Move:	1650	3	0	11	27000


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  2  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,0649999999999996

## ITERATION 193 #######################


> Neighbours evaluated; 113
> Selected Move:	1703	3	12	7	26500


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  1  0  2  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,0699999999999996

## ITERATION 194 #######################


> Neighbours evaluated; 110
> Selected Move:	1685	3	9	12	26500


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  2  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,0749999999999996

## ITERATION 195 #######################


> Neighbours evaluated; 110
> Selected Move:	1665	3	16	14	26000


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  0  0  2  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,0799999999999996

## ITERATION 196 #######################


> Neighbours evaluated; 112
> Selected Move:	1680	3	1	9	28000


> New Y[]: 
	
	 0  0  4  0  0  0  1  1  0  3  0  2  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,0849999999999996

## ITERATION 197 #######################


> Neighbours evaluated; 47
> Selected Move:	1674	4	9	12	27900


> New Y[]: 
	
	 0  0  4  0  0  0  1  1  0  1  0  2  3  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0  0  0 
 > pw :0,0899999999999996

## ITERATION 198 #######################


> Neighbours evaluated; 54
> Selected Move:	1660	3	12	1	26000


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  0  1  0  2  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,0949999999999996

## ITERATION 199 #######################


> Neighbours evaluated; 110
> Selected Move:	1598	4	11	7	26600


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  0  1  0  1  0  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,0999999999999996

## ITERATION 200 #######################


> Neighbours evaluated; 112
> Selected Move:	1590	3	14	16	27100


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  0  1  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,105

## ITERATION 201 #######################


> Neighbours evaluated; 108
> Selected Move:	1570	3	9	12	27100


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  0  0  0  1  1  0  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,11

## ITERATION 202 #######################


> Neighbours evaluated; 102
> Selected Move:	1564	3	16	14	26600


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  0  0  0  1  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,115

## ITERATION 203 #######################


> Neighbours evaluated; 108
> Selected Move:	1556	3	11	9	26600


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  0  1  0  0  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0 
 > pw :0,12

## ITERATION 204 #######################


> Neighbours evaluated; 109
> Selected Move:	1560	3	7	11	26500


> New Y[]: 
	
	 0  3  4  0  0  0  1  0  0  1  0  2  1  0  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0 
 > pw :0,125
________________________________________________________________

Best solution found: 1830
Run Termination time: 31.01.2010 11:05:20
Run duration: 00:02:07.7500000
________________________________________________________________
